Generalising the planar cubic Bézier spiral
نویسنده
چکیده
Spiral segments are useful in the design of fair curves. They are important in CAD/CAM applications, the design of highway and railway routes, trajectories of mobile robots and other similar applications. Cubic Bézier curves are commonly used in curve and surface design because they are of low degree, are easily evaluated, and allow inflection points. This paper generalises earlier results on planar cubic Bézier spiral segments. Classification AMS: 65D17, 68U07 (CAD) CR: I.3.5, J.6 (Computer Graphics, Computer Applications)
منابع مشابه
Smoothing Arc Splines Using Cubic Bézier Spiral Transitions
Arc splines are planar, tangent continuous, piecewise curves made of circular arcs and straight line segments. They are important in manufacturing industries because of their use in the cutting paths for numerically controlled cutting machinery, highway route and robot paths. This paper considers how to smooth three kinds of G biarc models: the C-, S-, and J-shaped, by replacing their parts by ...
متن کاملPlanar Cubic Space-like Bézier Curves in Three Dimensional Minkowski Space
This paper considers planar cubic Bézier curves in three-dimensional Minkowski space. We shall consider the conditions for the control points A,C,D,B of the Bézier curve such that the Bézier segment is pointwise space-like. For the control point C, we shall give a geometrical interpretation of the feasibility condition provided the rest of the control points are fixed.
متن کاملGeneralising the planar Pythagorean-hodograph quintic spiral
Abstract Spiral segments are useful in the design of fair curves. They are important in CAD/CAM applications, the design of highway and railway routes, trajectories of mobile robots and other similar applications. The quintic Pythagorean hodograph (PH) curve discussed in this technical report is polynomial; it has the attractive properties that its arc-length is a polynomial of its parameter, a...
متن کاملA Generalized Ring Spiral Algorithm for CodingFullerenes and other Cubic Polyhedra 1
The so-called ring spiral algorithm is a convenient means for generating and representing certain fullerenes and some other cubic poly-hedra. In 1993 Manolopoulos and Fowler presented a fullerene on 380 vertices without a spiral. No smaller unspirable fullerene is known. In the spring of 1997, using computer, Gunnar Brinkmann found the smallest cubic polyhedron without a spiral. It has only 18 ...
متن کاملA generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra
The so called ring spiral algorithm is a convenient means for gen erating and representing certain fullerenes and some other cubic poly hedra In Manolopoulos and Fowler presented a fullerene on vertices without a spiral No smaller unspirable fullerene is known In the spring of using computer Gunnar Brinkmann found the smallest cubic polyhedron without a spiral It has only vertices Here we gener...
متن کامل